Two Descent Statistics over 321-Avoiding Centrosymmetric Involutions

نویسندگان

  • Marilena Barnabei
  • Flavio Bonetti
  • Sergi Elizalde
  • Matteo Silimbani
چکیده

Centrosymmetric involutions in the symmetric group S2n are permutations π such that π = π−1 and π(i) + π(2n + 1 − i) = 2n + 1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the sum of the positions of these descents. Our results are based on two new bijections, one between centrosymmetric involutions in S2n and subsets of {1, . . . , n}, and another one showing that certain statistics on Young diagrams that fit inside a rectangle are equidistributed. We also use the latter bijection to refine a known result stating that the distribution of the major index on 321-avoiding involutions is given by the q-analogue of the central binomial coefficients.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A ug 2 01 5 Two descent statistics over 321 - avoiding centrosymmetric involutions

Centrosymmetric involutions in the symmetric group S2n are permutations π such that π = π−1 and π(i) + π(2n+1− i) = 2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the sum o...

متن کامل

Equidistribution and Sign-Balance on 321-Avoiding Permutations

Let Tn be the set of 321-avoiding permutations of order n. Two properties of Tn are proved: (1) The last descent and last index minus one statistics are equidistributed over Tn, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for T2n and T2n+1 are essentially equal to ...

متن کامل

ar X iv : m at h / 02 06 16 9 v 1 [ m at h . C O ] 1 7 Ju n 20 02 SOME STATISTICS ON RESTRICTED 132 INVOLUTIONS

In [GM] Guibert and Mansour studied involutions on n letters avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary pattern on k letters. They also established a bijection between 132-avoiding involutions and Dyck word prefixes of same length. Extending this bijection to bilateral words allows to determine more parameters; in particular, we consider the...

متن کامل

The Eulerian distribution on centrosymmetric involutions

We present an extensive study of the Eulerian distribution on the set of centrosymmetric involutions, namely, involutions in Sn satisfying the property σ(i) + σ(n+ 1− i) = n+ 1 for every i = 1 . . . n. We find some combinatorial properties for the generating polynomial of such distribution, together with an explicit formula for its coefficients. Afterwards, we carry out an analogous study for t...

متن کامل

Avoiding patterns in irreducible permutations

We explore the classical pattern avoidance question in the case of irreducible permutations, i.e., those in which there is no index i such that σ(i + 1) − σ(i) = 1. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2016